On temporal logic versus datalog

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Datalog LITE : Temporal versus deductive reasoning

In this paper we show that Datalog is well-suited as a temporal veriication language. Datalog is a well-known database query language relying on the logic programming paradigm. We introduce Datalog LITE, a fragment of Datalog with negation, and present a linear time model checking algorithm for Datalog LITE. We show that Datalog LITE subsumes temporal languages such as CTL and the alternation-f...

متن کامل

Complexity of Monadic inf-datalog. Application to temporal logic

In [] we defined Inf-Datalog and characterized the fragments of Monadic inf-Datalog that have the same expressive power as Modal Logic (resp. CTL, alternation-free Modal μ-calculus and Modal μ-calculus). We study here the time and space complexity of evaluation of Monadic inf-Datalog programs on finite models. We deduce a new unified proof that model checking has 1. linear data and program comp...

متن کامل

Datalog and Logic Databases

In relational databases, datalog is an important attribute which helps to develop declarative queries. It is certainly the prolog that contributes this non procedural language. Datalog offers more than query languages with its recursion feature. Realizing its potential the authors in the book on Datalog and Logic Databases have presented a logical flow of datalog and logical databases with the ...

متن کامل

Datalog vs. First-Order Logic

Our main result is that every datalog query expressible in rst-order logic is bounded; in terms of classical model theory it is a kind of compactness theorem for nite structures. In addition, we give some counter-examples delimiting the main result.

متن کامل

Defining Datalog in Rewriting Logic

In recent work, the effectiveness of using declarative languages has been demonstrated for many problems in program analysis. Using a simple relational query language, like Datalog, complex interprocedural analyses involving dynamically created objects can be expressed in just a few lines. By exploiting the power of the Rewriting Logic language Maude, we aim at transforming Datalog programs int...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2003

ISSN: 0304-3975

DOI: 10.1016/s0304-3975(02)00447-4